New parallel symmetric SOR preconditioners by multi-type partitioning
نویسنده
چکیده
A new parallel symmetric successive over-relaxation (PSSOR) preconditioner is proposed in this paper by the multi-type partition techniques introduced in SIAM J. Scientific Computing 20, 2006, pp. 1513-1533. In a general matrix expression, it is proved to be symmetric and positive-definite if the coefficient matrix of a linear system is symmetric and positive-definite. It is also proved to be equivalent to the SSOR preconditioner using the multi-type ordering. Thus, it works for the preconditioned conjugate gradient method (PCG) and can be analyzed by the classic SOR theory. Numerical tests on an anisotropic model problem show that the PSSOR preconditioner can make PCG to have a faster rate of convergence and better parallel performances than the red-black SSOR preconditioner. They also confirm that the PSSOR preconditioner can have a rate of convergence that is nearly the same as the classic sequential SSOR preconditioner when the problem has large anisotropy.
منابع مشابه
New Parallel SOR Method by Domain Partitioning
In this paper we propose and analyze a new parallel SOR method, the PSOR method, formulated by using domain partitioning and interprocessor data communication techniques. We prove that the PSOR method has the same asymptotic rate of convergence as the Red/Black (R/B) SOR method for the five-point stencil on both strip and block partitions, and as the four-color (R/B/G/O) SOR method for the nine...
متن کاملA new class of preconditioners for discontinuous Galerkin methods for unsteady 3D Navier-Stokes equations: ROBO-SGS
In this work we propose a new class of preconditioners for the speed-up of implicit time integration of discontinuous Galerkin discretizations of the three dimensional time dependent Navier-Stokes equations. This new class of preconditioners exploits the hierarchy of modal basis functions and introduces a flexible order of the offdiagonal Jacobian blocks. While the standard preconditioners ’blo...
متن کاملPerformance Evaluation of a New Parallel Preconditioner School of Computer Science
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the pre-conditioned conjugate gradient method. We have developed a new class of preconditioners, support tree preconditioners, that are based on the connectivity of the graphs corresponding to the matrices and are well-structured for parallel implementation. In this paper, ...
متن کاملMLD2P4 User’s and Reference Guide A guide for the Multi-Level Domain Decomposition Parallel Preconditioners Package based on PSBLAS
MLD2P4 (Multi-Level Domain Decomposition Parallel Preconditioners Package based on PSBLAS) is a package of parallel algebraic multi-level preconditioners. It implements various versions of one-level additive and of multi-level additive and hybrid Schwarz algorithms. In the multi-level case, a purely algebraic approach is applied to generate coarse-level corrections, so that no geometric backgro...
متن کاملPerformance evaluation of a new parallel preconditioner
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices associated with these linear systems are symmetric and positive definite, the systems are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 86 شماره
صفحات -
تاریخ انتشار 2009